On the Duals of Binary Hyper-Kloosterman Codes
نویسنده
چکیده
Abstract. Binary hyper-Kloosterman codes C(r,m) of length (2r − 1) are a quasi-cyclic generalization of the dual of the Melas code of length 2r − 1. In this note the duals C(r,m) i.e. a generalization of the Melas code C(r, 2) itself are studied. In particular, the minimum distance of C(r,m) for all r,m ≥ 2, the weight distribution of C(2, m) and C(2, m) for all m ≥ 2, and the weight distribution of C(r, 3) and C(r, 3) for all r ≥ 2 is obtained.
منابع مشابه
On the weight distribution of the duals of irreducible cyclic codes, cyclic codes with two zeros and hyper-Kloosterman codes
This paper considers the weight distributions of binary cyclic codes with one or two zeros and hyper-Kloosterman codes. The results on value distributions of certain monomial exponential sums and connections between exponential sums and Kloosterman sums are applied together with the Pless power moment identity in these conciderations. Explicit formulae for the number of low-weight codewords are...
متن کاملRecursive formulas generating power moments of multi-dimensional Kloosterman sums and m-multiple power moments of Kloosterman sums
Abstract. In this paper, we construct two binary linear codes associated with multi-dimensional and m−multiple power Kloosterman sums (for any fixed m) over the finite field Fq. Here q is a power of two. The former codes are dual to a subcode of the binary hyper-Kloosterman code. Then we obtain two recursive formulas for the power moments of multi-dimensional Kloosterman sums and for the m-mult...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملThe Value 4 of Binary Kloosterman Sums
Kloosterman sums have recently become the focus of much research, most notably due to their applications in cryptography and their relations to coding theory. Very recently Mesnager has showed that the value 4 of binary Kloosterman sums gives rise to several infinite classes of bent functions, hyper-bent functions and semi-bent functions in even dimension. In this paper we analyze the different...
متن کاملOn divisibility of exponential sums of polynomials of special type over fields of characteristic 2
We study divisibility by eight of exponential sums of several classes of functions over finite fields of characteristic two. For the binary classical Kloosterman sums K(a) over such fields we give a simple recurrent algorithm for finding the largest k, such that 2 divides the Kloosterman sum K(a). This gives a simple description of zeros of such Kloosterman sums.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 22 شماره
صفحات -
تاریخ انتشار 2008